66 per Va Si V E Computing

نویسندگان

  • Jin-Ling Lo
  • Pei-Yu Chi
  • Hao-Hua Chu
  • Hsin-Yen Wang
  • Seng-Cho T. Chou
چکیده

D eveloping new behavior or encou rag ing behav iora l changes in children can be challenging even for experienced parents and teachers. Such persuasion is usually verbal, but verbal-only persuasion isn’t always effective, particularly in children with communication difficulties, because it offers limited incentive to change. So, pediatric occupational therapists often use play-based activities to induce behavioral changes by leveraging children’s desire to play. The term play-based occupational therapy refers to the use of a child occupation—that is, play—to cultivate the general skills and abilities needed to perform daily functional activities.1 Play-based occupational therapy has proven successful in motivating behavioral changes in children,1 but it does have limitations. One drawback is that children often undergo treatment in specialized clinics during regular appointment hours. However, behavior such as eating, brushing teeth, or sleeping can’t be observed during this time. If therapists can’t directly observe these functional behaviors, they can’t intervene. Therefore, therapists can only train children in general skills and hope that they apply the skill when it’s needed.2 However, because activity performance is an interaction between a person, activity, and context, improving general skills doesn’t ensure improved performance in the target activities. A more direct approach involves making the target activities fun to engage children to actively participate, which directly enhances their performance. Pervasive computing can provide opportunities to extend occupational therapists’ reach from the treatment clinic to the client’s natural living environment. It also enables occupational therapists to use digital technology to implement effective behavior intervention programs and target specific functional behaviors where it naturally occurs and when it would prove most effective.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing the Szeged index of 4,4 ׳-bipyridinium dendrimer

Let e be an edge of a G connecting the vertices u and v. Define two sets N1 (e | G) and N2(e |G) as N1(e | G)= {xV(G) d(x,u) d(x,v)} and N2(e | G)= {xV(G) d(x,v) d(x,u) }.The number of elements of N1(e | G) and N2(e | G) are denoted by n1(e | G) and n2(e | G) , respectively. The Szeged index of the graph G is defined as Sz(G) ( ) ( ) 1 2 n e G n e G e E    . In this paper we compute th...

متن کامل

74 per Va Si V E Blockincomputing

T he Daidalos project (www. ist-daidalos.org) is employing pervasive computing to organize network and communication technologies to enhance the user experience. More specifically, Daidalos seeks to help users access services no matter where they are and to improve the user experience by accounting for contextual information and user preferences. Our motivation to improve the user experience co...

متن کامل

Computing GA4 Index of Some Graph Operations

The geometric-arithmetic index is another topological index was defined as 2 deg ( )deg ( ) ( ) deg ( ) deg ( ) G G uv E G G u v GA G u v     , in which degree of vertex u denoted by degG (u). We now define a new version of GA index as 4 ( ) 2 ε ( )ε ( ) ( ) ε ( ) ε ( ) G G e uv E G G G u v GA G   u v    , where εG(u) is the eccentricity of vertex u. In this paper we compute this new t...

متن کامل

A behavioural approach to obstacle avoidance for mobile manipulators based on distributed sensing

Un ultimo ringraziamento va a Lui, non si gioca a dadi qui, c'` e il Suo sogno per ognuno di noi, a noi non resta che viverlo.

متن کامل

Computing Szeged index of graphs on ‎triples

ABSTRACT Let ‎G=(V,E) ‎be a‎ ‎simple ‎connected ‎graph ‎with ‎vertex ‎set ‎V‎‎‎ ‎and ‎edge ‎set ‎‎‎E. ‎The Szeged index ‎of ‎‎G is defined by ‎ where ‎ respectively ‎ ‎ is the number of vertices of ‎G ‎closer to ‎u‎ (‎‎respectively v)‎ ‎‎than ‎‎‎v (‎‎respectively u‎).‎ ‎‎If ‎‎‎‎S ‎is a‎ ‎set ‎of ‎size‎ ‎ ‎ ‎let ‎‎V ‎be ‎the ‎set ‎of ‎all ‎subsets ‎of ‎‎S ‎of ‎size ‎3. ‎Then ‎we ‎define ‎t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009